1
عمومی::
مسئلهی کامل فروشندهی دورهگرد
CSP Covering salesman problem
The covering salesman problem (CSP), proposed by J.
CSP objective is to find the shortest Hamiltonian cycle on a subset of vertices that
traveling salesman problem (TSP) [10], which follows that CSP is also NP-hard.
Some solution methodologies were proposed in the literature for the CSP.
واژگان شبکه مترجمین ایران